A New Algorithm for Counting Circular Arc Intersections
نویسنده
چکیده
منابع مشابه
The intersection between some subclasses of circular-arc and circle graphs
The intersection graph of a family of arcs on a circle is called a circular-arc graph. This class of graphs admits some interesting subclasses: proper circular-arc graphs, unit circular-arc graphs, Helly circular-arc graphs and clique-Helly circular-arc graphs. The intersection graph of a family of chords in a circle is called a circle graph. Analogously, this class of graphs admits some subcla...
متن کاملRE2L: An Efficient Output-sensitive Algorithm for Computing Boolean Operation on Circular-arc Polygons
The boundaries of conic polygons consist of conic segments or second degree curves. The conic polygon has two degenerate or special cases: the linear polygon and the circular-arc polygon. The natural problem — boolean operation on linear polygons, has been well studied. Surprisingly, (almost) no article focuses on the problem of boolean operation on circular-arc polygons, which actually can als...
متن کاملOn some subclasses of circular-arc graphs
The intersection graph of a family of arcs on a circle is called a circular-arc graph. This class of graphs admits some interesting subclasses: proper circular-arc graphs, unit circular-arc graphs, Helly circular-arc graphs and clique-Helly circular-arc graphs. In this paper, all possible intersections of these subclasses are studied. There are thirteen regions. Twelve of these are nonempty, an...
متن کاملTransit Signal Priority: Proposing a Novel Algorithm to Decrease Delay and Environmental Impacts in BRT Route Intersections
Intersections are considered as the most critical parts of the bus rapid transit (BRT) system. Transit signal priority is one of the efficient solutions to reduce BRT fleet delays at intersections. The aim of this study is to propose a new algorithm to decrease the BRT fleet delays at actuated intersections, while reducing the negative impacts on different approaches. The adaptive strategy is a...
متن کاملRecognition of circular-arc graphs and some subclasses
In this work we present three new recognition algorithms for circular-arc graphs and for two subclasses of this graph class. We give a linear-time recognition algorithm for circular-arc graphs based on the algorithm of Eschen and Spinrad [ES93, Esc97]. Our algorithm is simpler than the earlier linear-time recognition algorithm of McConnell [McC03], which is the only linear time recognition algo...
متن کامل